Random walks, electric networks and the transience class problem of sandpiles
نویسندگان
چکیده
The Abelian Sandpile Model is a discrete di usion process de ned on graphs (Dhar [14], Dhar et al. [15]) which serves as the standard model of self-organized criticality. The transience class of a sandpile is de ned as the maximum number of particles that can be added without making the system recurrent ([4]). We develop the theory of discrete di usions in contrast to continuous harmonic functions on graphs and establish deep connections between standard results in the study of random walks on graphs and sandpiles on graphs. Using this connection and building other necessary machinery we improve the main result of Babai and Gorodezky (SODA 2007,[2]) of the bound on the transience class of an n × n grid, from O(n) to O(n). Proving that the transience class is small validates the general notion that for most natural phenomenon, the time during which the system is transient is small. In addition, we use the machinery developed to prove a number of auxiliary results. We exhibit an equivalence between two other tessellations of plane, the honeycomb and triangular lattices. We give general upper bounds on the transience class as a function of the number of edges to the sink. Further, for planar sandpiles we derive an explicit algebraic expression which provably approximates the transience class of G to within O(|E(G)|). This expression is based on the spectrum of the Laplacian of the dual of the graph G. We also show a lower bound of Ω(n) on the transience class on the grid improving the obvious bound of Ω(n).
منابع مشابه
2 9 Ja n 20 04 DEGREES OF TRANSIENCE AND RECURRENCE AND HIERARCHICAL RANDOM WALKS
The notion of degree and related notions concerning recurrence and transience for a class of Lévy processes on metric Abelian groups are studied. The case of random walks on a hierarchical group is examined with emphasis on the role of the ultrametric structure of the group and on analogies and differences with Euclidean random walks. Applications to separation of time scales and occupation tim...
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملThe Type Problem: Effective Resistance and Random Walks on Graphs
The question of recurrence or transience – the so-called type problem – is a central one in the theory of random walks. We consider edgeweighted random walks on locally finite graphs. The effective resistance of such weighted graphs is defined electrically and shown to be infinite if and only if the weighted graph is recurrent. We then introduce the Moore-Penrose pseudoinverse of the Laplacian ...
متن کاملRecursion and Random Walks
This paper examines conditions for recurrence and transience for random walks on discrete surfaces, such as Z, trees, and random environments. 1 Random Walks on Non-Random Environments 1.1 Definitions Definition 1. A class of subsets F of a set Ω is an algebra if the following hold: 1. ∅ ∈ F and Ω ∈ F . 2. A1, A2, . . . , An ∈ F =⇒ ⋃n i=1Ai ∈ F . 3. A ∈ F =⇒ A ∈ F . If additionally A1, A2, . . ...
متن کاملRecurrence and transience of multitype branching random walks
We study a discrete time Markov process with particles being able to perform discrete time random walks and create new particles, known as branching random walk (BRW). We suppose that there are particles of di erent types, and the transition probabilities, as well as o spring distribution, depend on the type and the position of the particle. Criteria of (strong) recurrence and transience are pr...
متن کامل